Randomized algorithms - PDFSEARCH.IO - Document Search Engine

Randomized algorithms
Results: 419

#	Item
341	Progress in Computational Complexity Theory Hong Zhu† Computer Sciences Department, Fudan University Shanghai[removed], China. Email: [removed] Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2006-02-17 15:41:40 Complexity classes Probabilistic complexity theory Analysis of algorithms Finite fields NP-complete NP Randomized algorithm P Lattice problem Theoretical computer science Computational complexity theory Applied mathematics
342	Copy Right 2009 – Sapper Software Ltd – All Rights Are Strictly Reserved. MR. ESTIMATOR® SOFTWARE WHAT IS MATH ANXIETY? www.sappersoftware.com Add to Reading List Source URL: www.ictpc.ca Language: English - Date: 2009-04-26 16:23:54 XTR Mathematical anxiety IP Algorithms Randomized rounding Algebraically closed group Mathematics Theoretical computer science Applied mathematics
343	Internationale Mathematische Nachrichten International Mathematical News Nouvelles Math´ematiques Internationales Die IMN wurden 1947 von R. Inzinger als Nachrichten der Mathematischen ” Add to Reading List Source URL: www.oemg.ac.at Language: English - Date: 2011-03-17 10:45:59 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Algorithm Minimum spanning tree Theoretical computer science Computational complexity theory Applied mathematics
344	Campbell Public Domain Record Linkage Software Page 1 of 27 pages Record Linkage Software in the Public Domain: A Comparison of Link Plus, The Link King, and a “Basic” Deterministic Algorithm Kevin M. Campbell, DrPH Add to Reading List Source URL: www.the-link-king.com Language: English - Date: 2009-06-12 01:05:06 Analysis of algorithms Data Mathematics Computer algebra Data management Record linkage Linkage Algorithm Randomized algorithm Mechanical engineering Machines Mechanisms
345	arXiv:1209.5993v4 [cs.CC] 11 Sep[removed]Geometric Complexity Theory V: Equivalence between blackbox derandomization of polynomial identity testing and derandomization of Noether’s Normalization Lemma Dedicated to Sri Ra Add to Reading List Source URL: ramakrishnadas.cs.uchicago.edu Language: English - Date: 2013-11-07 17:14:04 Analysis of algorithms Invariant theory Probabilistic complexity theory Randomized algorithm Time complexity Emmy Noether SC Polynomial Circuit complexity Theoretical computer science Computational complexity theory Mathematics
346	Journal of Machine Learning Research[removed]1460 Submitted 5/06; Revised 10/06; Published 7/07 Attribute-Efficient and Non-adaptive Learning of Parities and DNF Expressions∗ Add to Reading List Source URL: jmlr.org Language: English - Date: 2007-07-10 13:02:43 Computational complexity theory Probabilistic complexity theory Machine learning Cybernetics Probably approximately correct learning Randomized algorithm Time complexity Parity learning One-way function Theoretical computer science Applied mathematics Analysis of algorithms
347	Impact of Record-Linkage Methodology on Performance Indicators and Multivariate Relationships Kevin M. Campbell, DrPH Washington State Division of Alcohol and Substance Abuse Box 45330 Add to Reading List Source URL: www.the-link-king.com Language: English - Date: 2009-06-12 01:05:57 Applied mathematics Mathematics Probabilistic complexity theory Computer science Analysis of algorithms Algorithm RL Randomized algorithm Abuse Computer algebra Data management Record linkage
348	JOURNAL OF ALGORJTHMS 7,[removed]) Add to Reading List Source URL: www.tau.ac.il Language: English - Date: 2010-04-12 04:28:18 NP-complete problems Analysis of algorithms Probabilistic complexity theory Randomized algorithm Matching Graph coloring SL Line graph Method of conditional probabilities Theoretical computer science Graph theory Mathematics
349	From coding theory to efficient pattern matching Rapha¨el Clifford University of Bristol, Dept. of Computer Science Bristol, BS8 1UB, UK [removed] Klim Efremenko Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:17 Analysis of algorithms Probabilistic complexity theory Time complexity Matching Factorial Approximate string matching Randomized algorithm Big O notation Factorization of polynomials over a finite field and irreducibility tests Theoretical computer science Mathematics Computational complexity theory
350	Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering Nader H. Bshouty Technion Add to Reading List Source URL: www.phillong.info Language: English - Date: 2013-08-07 11:59:10 NP-complete problems Cluster analysis Analysis of algorithms Probabilistic complexity theory Randomized algorithm Connectivity Graph partition Neighbourhood Correlation clustering Graph theory Theoretical computer science Mathematics

UPDATE